An optimal convex hull algorithm in any fixed dimension
نویسندگان
چکیده
منابع مشابه
An Associative Dynamic Convex Hull Algorithm
This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the Jarvis March Algorithm. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be sup...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملSearch Convex Hull Algorithm
This note concerns the computation of the convex hull of a given set P = {p1, p2, . . . , pn} of n points in the plane. Let h denote the size of the convex hull, ie the number of its vertices. The value h is not known beforehand, and it can range anywhere from a small constant to n. We hav e already seen that any convex hull algorithm requires at least Ω(n lg n) time in the worst case, and have...
متن کاملAn Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D
We present an algorithm which computes the convex hull of a set of n spheres in dimension d in time O(n d d 2 e + n log n). It is worst-case optimal in three dimensions and in even dimensions. The same method can also be used to compute the convex hull of a set of n homothetic convex objects of IE d. If the complexity of each object is constant, the time needed in the worst case is O(n d d 2 e ...
متن کاملAn Associative Static and Dynamic Convex Hull Algorithm
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull algorithms. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1993
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02573985